منابع مشابه
Spring Central Sectional Sampler
The Zimmer program refers to a number of questions and conjectures posed by Robert Zimmer in the 1980s concerning smooth actions of lattices in higher-rank Lie groups. We report on some recent progress by the author and collaborators. Lattices in Higher-Rank Lie Groups The primary objects inmy talk are lattices Γ in higher-rank simple Lie groups G. The simplest example of such a lattice is Γ = ...
متن کاملThe Generalized Gibbs Sampler and the Neighborhood Sampler
The Generalized Gibbs Sampler (GGS) is a recently proposed Markov chain Monte Carlo (MCMC) technique that is particularly useful for sampling from distributions defined on spaces in which the dimension varies from point to point or in which points are not easily defined in terms of co-ordinates. Such spaces arise in problems involving model selection and model averaging and in a number of inter...
متن کاملA Font Family Sampler
\usepackage{FAMILY} where FAMILY is given in the subsection titles below. The body font in this document is from the TEX Gyre Bonum family, selected by a \usepackage{tgbonum} command in the document preamble, but the samples illustrate scores other font families. Like Computer Modern, Latin Modern, and the commercial Lucida and MathTime families, the TEX Gyre families offer extensive collection...
متن کاملStochastic Bouncy Particle Sampler
We introduce a stochastic version of the nonreversible, rejection-free Bouncy Particle Sampler (BPS), a Markov process whose sample trajectories are piecewise linear, to efficiently sample Bayesian posteriors in big datasets. We prove that in the BPS no bias is introduced by noisy evaluations of the log-likelihood gradient. On the other hand, we argue that efficiency considerations favor a smal...
متن کاملThe Polar Slice Sampler
This paper investigates the polar slice sampler, a particular type of the Markov chain Monte Carlo algorithm known as the slice sampler. This algorithm is shown to have convergence properties which under some circumstances are essentially independent of the dimension of the problem. For log-concave densities, the algorithm provably converges (from appropriate starting point) to within 0.01 of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notices of the American Mathematical Society
سال: 2018
ISSN: 0002-9920,1088-9477
DOI: 10.1090/noti1758